On the time-space tradeoff for sorting with linear queries
نویسندگان
چکیده
منابع مشابه
On the Time-Space Tradeoff for Sorting with Linear Queries
Extending a result of Borodin, et. al. [l], we show that any branching program using linear queries " rhixi: c " to sort n numibers i ⌧pp l **,⌧n must satisfy the time-space tradeoff relation TS = n(n*) , The same relation is also shown to be true for branching programs that uses queries " min R = ? " where R is any subset of {xl,x2,...,xnj .
متن کاملA nondeterministic space-time tradeoff for linear codes
We consider nondeterministic D-way branching programs computing functions f : D → {0, 1} in time at most kn. In the boolean case, where D = {0, 1}, no exponential lower bounds are known even for k = 2. Ajtai has proved such lower bounds for explicit functions over domains D of size at least n, and Beame, Saks and Thathachar for explicit functions over domains of size at least 2 k . In this note...
متن کاملSuper-linear time-space tradeoff lower bounds for randomized computation
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques are an extension of those used by Ajtai 14, 51 in his time-space tradeoffs for deterministic RAM algorithms computing element distinctness and for...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOptimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W = Θ(logn). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries in O( n logn ) time. This is (asymptot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1982
ISSN: 0304-3975
DOI: 10.1016/0304-3975(82)90060-3